package com.amado.course21BinaryTree;
/**
 * 二叉树
 * @author Administrator
 *
 */
public class Node {
	/**
	 * 左子树
	 */
	private Node left;
	/**
	 * 右子树
	 */
	private Node right;
	/**
	 * 节点名称
	 */
	private int value;
	public Node getLeft() {
		return left;
	}
	public void setLeft(Node left) {
		this.left = left;
	}
	public Node getRight() {
		return right;
	}
	public void setRight(Node right) {
		this.right = right;
	}
	public int getValue() {
		return value;
	}
	public void setValue(int value) {
		this.value = value;
	}
	public Node(int value) {
		super();
		this.value = value;
	}
	

	
}
